Scheduling with Transportation
نویسنده
چکیده
Traditionally, machine scheduling research has focused only on efficiently assigning machine-time to jobs. It has not addressed the issue of how the jobs reach the machine from their originating source or how the finished jobs are delivered to their customers. In reality, the transportation time is substantial and hence cannot be ignored. Most of these variants are N P -hard. The scheduling problems that consider transportation can be considered as generalized versions of “pure” machine-scheduling problems (where the transportation cost is trivial) and “pure” dial-a-ride problems (where the scheduling cost is trivial). In this paper, we will consider the variant, where jobs are processed on a parallel machine environment (m identical machines), and are then shipped to the customer, using one vehicle of capacity one. The goal is to minimize the sum of completion delivery times of jobs.
منابع مشابه
َA Multi-objective simulated annealing algorithm to solving flexible no-wait flowshop scheduling problems with transportation times
This paper deals with a bi-objective hybrid no-wait flowshop scheduling problem minimizing the makespan and total weighted tardiness, in which we consider transportation times between stages. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time by using traditional approaches and optimization tools is extremely difficult. This paper presen...
متن کاملHeuristic Approach for Specially Structured Two Stage Flow Shop Scheduling to Minimize the Rental Cost, Processing Time, Set Up Time Are Associated with Their Probabilities Including Transportation Time and Job Weightage
The present paper is an attempt to develop a new heuristic algorithm, find the optimal sequence to minimize the utilization time of the machines and hence their rental cost for two stage specially structured flow shop scheduling under specified rental policy in which processing times and set up time are associated with their respective probabilities including transportation time. Further jo...
متن کاملPlanning in a cross dock network with an operational scheduling overview
Nowadays, cross docking plays an important role in the supply chain networks especially in transportation systems. According to the cross dock system advantages such as reducing transportation costs, lead times, and inventories, scheduling in a cross-dock center would be more complicated by increasing the number of suppliers, customers and product types. Considering the cross dock limited capac...
متن کاملSupply Chain Scheduling Using a Transportation System Composed of Vehicle Routing Problem and Cross-Docking Approaches
This study considers a combination of cross-docking and vehicle routing problem (VRP) approachesto transport raw material and parts in a supply chain. The supply chain is composed of some supplierswhich are spread in different geographical zones and multiple shared vehicles with different speedsand capacities for transporting orders from the suppliers to a manufacturer. After ...
متن کاملBi-criteria Three Stage Fuzzy Flowshop Scheduling with Transportation Time and Job Block Criteria
Scheduling is an enduring process where the existence of real time information frequently forces the review and modification of pre-established schedules. The real world is complex and complexity generally arises from uncertainty. From this prospective the concept of fuzziness is introduced in the field of scheduling. The present paper pertains to a bi-criterion in n-jobs, three machines fl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002